Factoring Polynomials with Rational Coe cients
نویسنده
چکیده
منابع مشابه
Fast determination of the tensorial and simplicial Bernstein forms of multivariate polynomials and rational functions
Tests for speeding up the determination of the Bernstein enclosure of the range of a multivariate polynomial and a rational function over a box and a simplex are presented. In the polynomial case, this enclosure is the interval spanned by the minimum and the maximum of the Bernstein coe cients which are the coe cients of the polynomial with respect to the tensorial or simplicial Bernstein basis...
متن کاملA formal study of Bernstein coefficients and polynomials
Bernstein coe cients provide a discrete approximation of the behavior of a polynomial inside an interval. This can be used for example to isolate real roots of polynomials. We prove a criterion for the existence of a single root in an interval and the correctness of the de Casteljau algorithm to compute e ciently Bernstein coe cients. Key-words: Polynomials, de Casteljau, Bernstein polynomials,...
متن کاملOptimal Oscillation Points for Polynomials of Restricted Growth on the Real Line
Computational methods are given in [3] to determine the maximum possible absolute value of each of the coe cients of the polynomials in this class when satis es some restrictions. It is also shown that there exist polynomials P and Q in the class such that each of the nonzero coe cients of P and Q have the largest possible absolute value of any polynomial in the class. The extremal polynomials ...
متن کاملUnimodality and the Reeection Principle
We show how lattice paths and the re ection principle can be used to give easy proofs of unimodality results. In particular, we give a \one-line" combinatorial proof of the unimodality of the binomial coe cients. Other examples include products of binomial coe cients, polynomials related to the Legendre polynomials, and a result connected to a conjecture of Simion.
متن کاملOre Subresultants in Solutions
The subresultants play a fundamental role in elimination theory and computer algebra. Recently they have been extended to Ore polynomials. They are de ̄ned by an expression in the coe±cients of Ore polynomials. In this paper, we provide another expression for them. This expression is written in terms of the \solutions" of Ore polynomials (in \generic" case). It is a generalization of our previou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998